Addendum: Minimum weight spanning trees with bounded diameter
نویسندگان
چکیده
The simplest way to overcome the problem is to change formulation. Recall that in [1] we extended the given directed graph G* with one source (s) and two sinks slightly the graph G to a (t and t ). 1 2 Further, our formulation restricted the out degree of the source s to one. Here we modify the directed graph by allowing only one sink et) and restricting the out degree of the source s to at most 1 1 1 + r "2 D1 l "2 D J; we call the result ing directed graph G* and use
منابع مشابه
A sharp threshold for minimum bounded-depth/diameter spanning and Steiner trees
In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to ζ(3) = 1/13 + 1/23 + 1/33 + · · · as n → ∞. We consider spanning trees constrained to have depth bounded by k from a specified root. We prove that if k ≥ log2 log n+ω(1), where ω(1) is any function going to ∞ with n, then th...
متن کاملMinimum weight spanning trees with bounded diameter
Let G be a simple graph with non-negative edge weights. Determining a minimum weight spanning tree is a fundamental problem that arises in network design and as a subproblem in many combinatorial optimization problems such as vehicle routing. In some applications, it is necessary to restrict the diameter of the spanning tree and thus one is interested in the problem : Find, in a given weighted ...
متن کاملA Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
The diameter of a tree is the largest number of edges on any path between two vertices in it. Given a weighted, connected, undirected graph G and a bound D ≥ 2, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of minimum weight whose diameter does not exceed D. An evolutionary algorithm for this NP-hard problem encodes candidate trees as permutations of their vertic...
متن کاملOn Algorithm for the Minimum Spanning Trees Problem with Diameter Bounded Below
The minimum spanning trees problem is to find k edge-disjoint spanning trees in a given undirected weighted graph. It can be solved in polynomial time. In the k minimum spanning trees problem with diameter bounded below (k-MSTBB) there is an additional requirement: a diameter of every spanning tree must be not less than some predefined value d. The k-MSTBB is NP hard. We propose an asymptotical...
متن کاملLow-Light Trees, and Tight Lower Bounds for Euclidean Spanners
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T ) = O(k · n) · w(MST (M)), and a spanning tree T ′ with weight w(T ′) = O(k) · w(MST (M)) and unweighted diameter O(k · n). These trees also achieve an optimal maximum degree. Furthermore, we demonstrate that these trees can be constructed efficiently...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 8 شماره
صفحات -
تاریخ انتشار 1993